A Note on Negation: A PCS-Completion of Semilattices
نویسنده
چکیده
In the paper “Which concept lattices are pseudocomplemented?” ([GK05]) we gave a contextual characterization of pseudocomplemented concept lattices by means of the arrow relations. In this contribution we use this description to embed finite semilattices into pseudocomplemented semilattices. This process can be used to define a negation on concepts.
منابع مشابه
Learning the Scope of Negation via Shallow Semantic Parsing
s Papers Clinical PCLB PCRB PCS PCLB PCRB PCS PCLB PCRB PCS autoparse(t&t) 91.97 87.82 80.88 85.45 67.20 59.26 97.48 88.30 85.89 autoparse(test) 92.71 88.33 81.84 87.57 68.78 62.70 97.48 87.73 85.21 oracle 99.72 94.59 94.37 98.94 84.13 83.33 99.89 98.39 98.39 Table 5: Performance (%) of negation scope finding on the three subcorpora by using automatic parser trained with 6,691 sentences in GTB1...
متن کاملA Note on the Exact Completion of a Regular Category, and Its Infinitary Generalizations
A new description of the exact completion Cex/reg of a regular category C is given, using a certain topos Shv(C) of sheaves on C; the exact completion is then constructed as the closure of C in Shv(C) under finite limits and coequalizers of equivalence relations. An infinitary generalization is proved, and the classical description of the exact completion is derived.
متن کاملNote on Priestley-style Duality for Distributive Meet-semilattices
We carry out a detailed comparison of the two topological dualities for distributive meet-semilattices studied by Celani [3] and by Bezhanishvili and Jansana [2]. We carry out such comparison, that was already sketched in [2], by defining the functors involved in the equivalence of both dual categories of distributive meet-semilattices.
متن کاملTight logic programs
This note is about the relationship between two theories of negation as failure—one based on program completion, the other based on stable models, or answer sets. François Fages showed that if a logic program satisfies a certain syntactic condition, which is now called “tightness,” then its stable models can be characterized as the models of its completion. We extend the definition of tightness...
متن کاملCanonical Extensions and Profinite Completions of Semilattices and Lattices
Canonical extensions of (bounded) lattices have been extensively studied, and the basic existence and uniqueness theorems for these have been extended to general posets. This paper focuses on the intermediate class S∧ of (unital) meet semilattices. Any S ∈ S∧ embeds into the algebraic closure system Filt(Filt(S)). This iterated filter completion, denoted Filt(S), is a compact and ∨∧ -dense exte...
متن کامل